Description: 程序用JAVA语言编写, 综合利用图结构和堆栈结构进行数据组织和处理. 可以进行正则表达式到NFA的转化, 并能用图形直观的表示.
对正则表达式有一些约定, 就是可以用单个字符表示输入, 也可以用 ‘ ‘ 连接起来的一串字符进行输入. 有基本的表达式以及由基本表达式构成的并置, 选择和重复的操作.
例:
A|b*c
‘letter’*’digit’
等都是合法输入. 还带有括号功能, 优先级
-procedures using Java language. Comprehensive Utilization graph structure and stack structure and data processing. it is a regular expression for NFA to the transformation and can use the intuitive graphical said. Regular expressions are to some agreement and it is expressed with a single character input, we could also use '' linking the string of characters for importation. a basic expressions and by the basic form of expression and Home and choose and repeat the operation. cases : A | b* c 'letter'* 'digit' are all legally imported. also bracketed with functionality, prioritized Platform: |
Size: 12288 |
Author:onlyerlee |
Hits:
Search - processing of an NFA